Abstract:

To stimulate the cooperation between the nodes in selfish networks and to make joint assignment of bandwidth and route, the auction theory is used to analyze the rational behavior of the node in selfish networks and to make the bandwidth assignment for multipath multihop routing as the auction model. Two schemes of bandwidth assignment for the multipath multihop routing are proposed. One scheme is based on convex optimization, the other is based on least cost path (LCP). Analysis illustrates that the mechanism is strategyproof. Extensive evaluations show that the mechanism can simulate the cooperation between the players.

Key words: game theory, auction theory, bandwidth assignment, routing, strategyproof